Speed-Up Techniques for Negation in Grounding
نویسندگان
چکیده
Grounding is the task of reducing a first order formula to ground formula that is equivalent on a given universe, and is important in many kinds of problem solving and reasoning systems. One method for grounding is based on an extension of the relational algebra, exploiting the fact that grounding over a given domain is similar to query answering. In this paper, we introduce two methods for speeding up algebraic grounding by reducing the size of tables produced. One method employs rewriting of the formula before grounding, and the other uses a further extension of the algebra that makes negation efficient. We have implemented the methods, and present experimental evidence of their effectiveness.
منابع مشابه
Extraction of Drug-Drug Interaction from Literature through Detecting Linguistic-based Negation and Clause Dependency
Extracting biomedical relations such as drug-drug interaction (DDI) from text is an important task in biomedical NLP. Due to the large number of complex sentences in biomedical literature, researchers have employed some sentence simplification techniques to improve the performance of the relation extraction methods. However, due to difficulty of the task, there is no noteworthy improvement in t...
متن کاملComputing Stable Models of Normal Logic Programs Without Grounding
We present a method for computing stable models of normal logic programs, i.e., logic programs extended with negation, in the presence of predicates with arbitrary terms. Such programs need not have a finite grounding, so traditional methods do not apply. Our method relies on the use of a non-Herbrand universe, as well as coinduction, constructive negation and a number of other novel techniques...
متن کاملStable models and circumscription
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programming. In this paper we propose a new definition of that concept, which covers many constructs used in answer set programming and, unlike the original definition, refers neither to grounding nor to fixpoints. It is based ...
متن کاملImpact of Ocean-Land Mixed Propagation Path on Equivalent Circuit of Grounding Rods
In this paper, the effect of ocean-land mixed propagation path on the lightning performance of grounding rods is investigated. This effect is focused on two problems. The first is extracting exact equivalent circuit of grounding rods in the presence of oceans. The equivalent circuit can be used in transient analysis of power systems in the neighboring oceans. In the second one, this effect on t...
متن کاملSLDNF, Constructive Negation and Grounding
In some approaches to the declarative semantics of logic programming, a program is treated as shorthand for the propositional program Ground(() whose rules are the ground instances of the rules of. We relate the success and failure of a program with a goal G under SLDNF with constructive negation to the success and failure of Ground(() with ground instances of G under propositional SLDNF. As a ...
متن کامل